package 力扣._718最长重复子数组;

public class Solution {
    public int findLength(int[] nums1, int[] nums2) {
        //dp[i][j]: 以i-1为结尾的nums1 与 以j-1为结尾的nums2 的最长重复子数组
        int[][] dp = new int[nums1.length + 1][nums2.length + 1];
        int max = 0;
        for (int i = 1; i <= nums1.length; i++) {
            for (int j = 1; j <= nums2.length; j++) {
                if (nums1[i - 1] == nums2[j - 1])
                    dp[i][j] = dp[i - 1][i - 1] + 1;
                else
                    dp[i][j] = 0;
                max = Math.max(max, dp[i][j]);
            }
        }
        return max;
    }
}
